Linear Algorithms with Finite Deviation
نویسندگان
چکیده
منابع مشابه
Linear Algorithms with Finite Deviation
We discuss the computation of If], where I is a positive functional on C a; b]. Any algorithm starts with some input, in typical situations this input consists of function values (f (x 1) ; : : : ; f (x n)) and the more global information f 2 K, where K C a; b] is a given set. The algorithm which makes the fullest use of the input is called the strongly optimal algorithm. We shall show that in ...
متن کاملAlgorithms for linear groups of finite rank
Article history: Received 21 January 2013 Available online 16 July 2013 Communicated by Derek Holt
متن کاملFinite p-groups with few non-linear irreducible character kernels
Abstract. In this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.
متن کاملFinite Abstractions of Max-Plus-Linear Systems: Theory and Algorithms
ion function f , i.e. f−1(ŝ) = {s : f (s) = ŝ}. Recall that f−1(ŝ) is a block (or in fact a DBM) and the dynamics in each block are affine. If there exists a transition from an outgoing state s to an incoming state s′ in the concrete transition system, i.e. s γ −−→ s′, then there is a transition from f (s) to f (s′) in the abstract transition system, i.e. f (s) γ −−→ f f (s′) [23, Def. 7.51]. S...
متن کاملfinite p-groups with few non-linear irreducible character kernels
abstract. in this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1998
ISSN: 0885-064X
DOI: 10.1006/jcom.1997.0468